Interval Routing Schemes for Circular-Arc Graphs
نویسندگان
چکیده
Interval routing is a space efficient method to realize a distributed routing function. In this paper we show that every circular-arc graph allows a shortest path strict 2-interval routing scheme, i.e., by introducing a global order on the vertices and assigning at most two (strict) intervals in this order to the ends of every edge allows to depict a routing function that implies exclusively shortest paths. Since circular-arc graphs do not allow shortest path 1interval routing schemes in general, the result implies that the class of circular-arc graphs has strict compactness 2, which was a hitherto open question. Additionally, we show that the constructed 2-interval routing scheme is a 1-interval routing scheme with at most one additional interval assigned at each vertex and we outline an algorithm to calculate the routing scheme for circular-arc graphs in O(c + n) time, where n is the number of vertices and c is the number of maximal cliques.
منابع مشابه
Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes
Distance labelings and compact routing schemes have both been active areas of recent research. It was already known that graphs with constant-sized recursive separators, such as trees, outerplanar graphs, series-parallel graphs and graphs of bounded treewidth, support both exact distance labelings and optimal (additive stretch 0, multiplicative stretch 1) compact routing schemes, but there are ...
متن کاملPaired domination on interval and circular-arc graphs
We study the paired-domination problem on interval graphs and circular-arc graphs. Given an interval model with endpoints sorted, we give an O(m + n) time algorithm to solve the paired-domination problem on interval graphs. The result is extended to solve the paired-domination problem on circular-arc graphs in O(m(m+ n)) time. MSC: 05C69, 05C85, 68Q25, 68R10, 68W05
متن کاملClique graphs of Helly circular arc graphs
Abstract: Clique graphs of several classes of graphs have been already characterized. Trees, interval graphs, chordal graphs, block graphs, clique-Helly graphs are some of them. However, no characterization of clique graphs of circular-arc graphs and some of their subclasses is known. In this paper, we present a characterization theorem of clique graphs of Helly circular-arc graphs and prove th...
متن کاملA Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
A circular-arc modelM = (C,A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, and if some point of C is not covered by any arc then M is an interval model. A (proper) (interval) circulararc graph is the intersection graph of a (proper) (interval) circular-arc model. Circular-arc graphs and their subclasses have ...
متن کاملComputing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time
The longest path problem asks for a path with the largest number of vertices in a given graph. In contrast to the Hamiltonian path problem, until recently polynomial algorithms for the longest path problem were known only for small graph classes, such as trees. Recently, a polynomial algorithm for this problem on interval graphs has been presented in Ioannidou et al. (2011) [19] with running ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 28 شماره
صفحات -
تاریخ انتشار 2017